#include"Sort.h"

void TestQuickSort2()
{
	int a[] = { 9,5,1,2,4,3,7,6,8 };
	PrintArray(a, sizeof(a) / sizeof(int));
	QuickSort2(a, 0, sizeof(a) / sizeof(int) - 1);
	PrintArray(a, sizeof(a) / sizeof(int));
}

void TestMergeSortNonR()
{
	int a[] = { 9,5,1,2,4,3,7,6,8 };
	PrintArray(a, sizeof(a) / sizeof(int));
	MergeSortNonR(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}

int main()
{
	//TestQuickSort2();
	TestMergeSortNonR();
	return 0;
}